منابع مشابه
Hypo-efficient domination and hypo-unique domination
For a graph $G$ let $gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least one EDS, and (ii) a hypo-unique domination graph (a hypo-$mathcal{UD}$ graph) if $G$ has at least two minimum dominating sets...
متن کاملThe hypo-hyper syndrome.
he coexistence of thyroid and parathyroid diseases is not rare. In the review of the recent literature, 25% of the patients with primary hyperparathyroidism (PHPT) had significant associated thyroid diseases including carcinoma in an Australian series.1 Regal et al,2 reported a high prevalence of unsuspected varieties of thyroid disease occurring mainly in postmenopausal women in patients with ...
متن کاملHyperparathyroidism.
Hyperparathyroidism is due to increased activity of the parathyroid glands, either from an intrinsic abnormal change altering excretion of parathyroid hormone (primary or tertiary hyperparathyroidism) or from an extrinsic abnormal change affecting calcium homoeostasis stimulating production of parathyroid hormone (secondary hyperparathyroidism). Primary hyperparathyroidism is the third most com...
متن کاملImmunologic Differentiation of Primary Hyperparathyroidism from Hyperparathyroidism
A B S T R A C T Serum immunoreactive parathyroid hormone (IPTH) was measured by radioimmunoassay in 54 patients with primary hyperparathyroidism and in 18 consecutive patients with ectopic hyperparathyroidism due to nonparathyroid cancer without apparent skeletal metastasis. Although serum calcium concentration was higher in the group with ectopic hyperparathyroidism, serum IPTH was lower (rank...
متن کاملhypo-efficient domination and hypo-unique domination
for a graph $g$ let $gamma (g)$ be its domination number. we define a graph g to be (i) a hypo-efficient domination graph (or a hypo-$mathcal{ed}$ graph) if $g$ has no efficient dominating set (eds) but every graph formed by removing a single vertex from $g$ has at least one eds, and (ii) a hypo-unique domination graph (a hypo-$mathcal{ud}$ graph) if $g$ has at least two minimum dominating sets...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archives of Disease in Childhood
سال: 1968
ISSN: 0003-9888,1468-2044
DOI: 10.1136/adc.43.229.295